Parameterized verification

The goal of parameterized verification is to prove the correctness of a system specification regardless of the number of its components. The problem is of interest in several different areas: verification of hardware design, multithreaded programs, distributed systems, and communication protocols. The problem is undecidable in general. Solutions for restricted classes of systems and properties have been studied in areas like theorem proving, model checking, automata and logic, process algebra, and constraint solving. In this introduction to the special issue, dedicated to a selection of works from the Parameterized Verification workshop PV \u201914 and PV \u201915, we survey some of the works developed in this research area

Photoluminescence and Electron Spin Resonance of ilicon Dioxide Crystal with Rutile Structure (Stishovite)

This work was supported by ERANET MYND. Also, financial support provided by Scientific Research Project for Students and Young Researchers Nr. SJZ/2017/2 realized at the Institute of Solid State Physics, University of Latvia is greatly acknowledged. The authors express our gratitude to R.I. Mashkovtsev for help in ESR signal interpretation. The authors are appreciative to T.I. Dyuzheva, L.M. Lityagina, N.A. Bendeliani for stishovite single crystals and to K. Hubner and H.-J. Fitting for stishovite powder of Barringer Meteor Crater.An electron spin resonance (ESR) and photoluminescence signal is observed in the as grown single crystal of stishovite indicating the presence of defects in the non‐irradiated sample. The photoluminescence of the as received stishovite single crystals exhibits two main bands – a blue at 3 eV and an UV at 4.75 eV. Luminescence is excited in the range of optical transparency of stishovite (below 8.75 eV) and, therefore, is ascribed to defects. A wide range of decay kinetics under a pulsed excitation is observed. For the blue band besides the exponential decay with a time constant of about 18 μs an additional ms component is revealed. For the UV band besides the fast component with a time constant of 1–3 ns a component with a decay in tens μs is obtained. The main components (18 μs and 1–3 ns) possess a typical intra‐center transition intensity thermal quenching. The effect of the additional slow component is related to the presence of OH groups and/or carbon molecular defects modifying the luminescence center. The additional slow components exhibit wave‐like thermal dependences. Photo‐thermally stimulated creation–destruction of the complex comprising host defect and interstitial modifiers explains the slow luminescence wave‐like thermal dependences.ERANET MYND; ISSP UL Nr. SJZ/2017/2 ; Institute of Solid State Physics, University of Latvia as the Center of Excellence has received funding from the European Union’s Horizon 2020 Framework Programme H2020-WIDESPREAD-01-2016-2017-TeamingPhase2 under grant agreement No. 739508, project CAMART

Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach

This paper studies the problem of computing Nash equilibrium in wireless networks modeled by Weighted Timed Automata. Such formalism comes together with a logic that can be used to describe complex features such as timed energy constraints. Our contribution is a method for solving this problem using Statistical Model Checking. The method has been implemented in UPPAAL model checker and has been applied to the analysis of Aloha CSMA/CD and IEEE 802.15.4 CSMA/CA protocols.Comment: In Proceedings IWIGP 2012, arXiv:1202.422

Software Model Checking with Explicit Scheduler and Symbolic Threads

In many practical application domains, the software is organized into a set of threads, whose activation is exclusive and controlled by a cooperative scheduling policy: threads execute, without any interruption, until they either terminate or yield the control explicitly to the scheduler. The formal verification of such software poses significant challenges. On the one side, each thread may have infinite state space, and might call for abstraction. On the other side, the scheduling policy is often important for correctness, and an approach based on abstracting the scheduler may result in loss of precision and false positives. Unfortunately, the translation of the problem into a purely sequential software model checking problem turns out to be highly inefficient for the available technologies. We propose a software model checking technique that exploits the intrinsic structure of these programs. Each thread is translated into a separate sequential program and explored symbolically with lazy abstraction, while the overall verification is orchestrated by the direct execution of the scheduler. The approach is optimized by filtering the exploration of the scheduler with the integration of partial-order reduction. The technique, called ESST (Explicit Scheduler, Symbolic Threads) has been implemented and experimentally evaluated on a significant set of benchmarks. The results demonstrate that ESST technique is way more effective than software model checking applied to the sequentialized programs, and that partial-order reduction can lead to further performance improvements.Comment: 40 pages, 10 figures, accepted for publication in journal of logical methods in computer scienc